Optimal All-to-All Personalized Exchange by Regularly Changing Switch States in Self-Routable Multistage Networks
نویسنده
چکیده
Abstract-We find the permutation routing algorithm proposed by Lai [3] is closely related to the personalized exchange algorithm investigated by Yang and Wang [1] previously. Inspired by the idea of Lai, we modified Yang et al’s the personalized exchange algorithm in a pipelined version, and present a new switching pattern for reducing the changing speed of switching states by a half.
منابع مشابه
Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks
ÐAll-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important applications in parallel computing. Previous all-to-all personalized exchange algorithms were mainly developed for hypercube and mesh/torus networks. Although the algorithms for a hypercube may achieve optimal time complexity, the network suffers from unbounded node degrees ...
متن کاملOptimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks
All-to-all personalized exchange occurs in many important applications in parallel processing. In the past two decades, algorithms for all-to-all personalized exchange were mainly proposed for hypercubes, meshes, and tori. Recently, Yang and Wang (IEEE Trans Parallel Distrib Syst 11:261–274, 2000) proposed an optimal all-to-all personalized exchange algorithm for binary (each switch is of size ...
متن کاملOptimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the inc...
متن کاملËëòóðó ×××××ûò ½ Ëøñóóðð Ôöó ³ ××××× ½ Ööø Ð Ø Øùù ××òòò×× Ôóù Õóùò Ôöóø Ññøø Øó ¾¼¼¼º
An optical multistage interconnection network for optimal all-to-all personalized exchange, They propose an optical multistage interconnection network to realize an all-to-all personalized exchange that only requires one pass to send a message from each node to a different node (to realize a permutation). Hence, the new optical multistage interconnection network only requires n-1 passes for an ...
متن کاملO(n) routing in rearrangeable networks
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n) compared to its propagation delay O(n) only. Here, we attempt to identify the sets of permutations, which are routable in O(n) time in these networks. We de®ne four classes of self-routable permutations for Benes network. An O(n) algorithm is presented here, that identi®es if any permutation P belongs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013